Planning as Model Checking
نویسندگان
چکیده
The goal of this paper is to provide an introduction, with various elements of novelty, to the Planning as Model Checking paradigm.
منابع مشابه
Theory and Algorithms for Partial Order Based Reduction in Planning
Search is a major technique for planning. It amounts to exploring a state space of planning domains typically modeled as a directed graph. However, prohibitively large sizes of the search space make search expensive. Developing better heuristic functions has been the main technique for improving search efficiency. Nevertheless, recent studies have shown that improving heuristics alone has certa...
متن کاملFriends or Foes? An AI Planning Perspective on Abstraction and Search PRELIMINARY VERSION - UNDER REVIEW
There is increasing awareness that planning and model checking are closely related fields. Abstraction, as used in model checking, means to perform search in an overapproximation of the original problem instance, with a potentially much smaller state space; certain properties proved in the abstract problem are guaranteed to also hold for the original problem. This method is extremely successful...
متن کاملPlanning as Model Checking in Hybrid Domains
Planning in hybrid domains is an important and challenging task, and various planning algorithms have been proposed in the last years. From an abstract point of view, hybrid planning domains are based on hybrid automata, which have been studied intensively in the model checking community. In particular, powerful model checking algorithms and tools have emerged for this formalism. However, despi...
متن کاملMapping Temporal Planning Constraints into Timed Automata
Planning and Model Checking are similar in concept. They both deal with reaching a goal state from an initial state by applying specified rules that allow for the transition from one state to another. Exploring the relationship between them is an interesting new research area. We are interested in planning frameworks that combine both planning and scheduling. For that, we focus our attention on...
متن کاملObdd-based Deterministic Planning Using the Umop Planning Framework
Model checking representation and search techniques were recently shown to be eeciently applicable to planning. Ordered Binary Decision Diagrams (obdds) encode a planning domain as a nite transition system and fast algorithms from model checking search for a solution plan. With proper encodings, obdds can effectively scale and can provide plans for complex planning domains. In this paper, we pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999